Exploration and Exploitation in an Artificial Experimenter

نویسندگان

  • Chris Lovell
  • Klaus-Peter Zauner
  • Steve Gunn
چکیده

An artificial experimenter is a computational implementation of the decision making processes a laboratory experimenter will make. Artificial experimenter’s analyse the available data, propose hypotheses to represent the behaviours investigated and design experiments to evaluate or improve those hypotheses. In doing so they perform active discovery. A key problem faced is deciding when to perform experiments that exploit the information held within the current hypotheses to evaluate them and when to perform experiments that explore the parameter space to discover features of the behaviour being investigated not yet identified. As resources in physical experimentation are extremely limited, addressing this trade-off is critical to obtaining a representative model of the system under investigation. To achieve this, a Bayesian notion of surprise has been used to effectively manage the transition between exploration and exploitation in simulated and physical experimental trials.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems

Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...

متن کامل

Augmented Downhill Simplex a Modified Heuristic Optimization Method

Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...

متن کامل

Artificial Bee Colony (ABC) Algorithm Exploitation and Exploration Balance

Nature inspired metaheuristics proved to be very successful when applied to hard optimization problems, combinatorial as well as global. For all these algorithms, with very different basic ideas, parameters and implementation details, the common problem that ultimately determines the successfulness of a particular algorithm is balance between exploitation and exploration. Exploitation refers to...

متن کامل

Diversity Measures in Artificial Bee Colony

Artificial Bee Colony (ABC) is a recent swarm intelligence based approach to solve nonlinear and complex optimization problems. Exploration and exploitation are the two important characteristics of the swarm based optimization algorithms. Exploration capability of an algorithm is the capability of exploring the solution space to find the possible solution while exploitation capability of an alg...

متن کامل

A hybrid meta-heuristic algorithm based on ABC and Firefly algorithms

Abstract— In this paper we have tried to develop an altered version of the artificial bee colony algorithm which is inspired from and combined with the meta-heuristic algorithm of firefly. In this method, we have tried to change the main equation of searching within the original ABC algorithm. On this basis, a new combined equation was used for steps of employed bees and onlooker bees. For this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011